memory scheduling造句
例句與造句
- The paper realizes many significant scheduling algorithms mainly including rapid panorama reflection , intelligent virtual objects prediction and memory schedule in virtual walkthrough system
實(shí)現(xiàn)了虛擬漫游系統(tǒng)中的一些關(guān)鍵的調(diào)度算法，主要包括全景圖的快速重投影算法、虛擬對象的智能預(yù)測算法和內(nèi)存調(diào)度算法。 - Considering the np - complete problem , how to get the approximate optimized scheme of job - shop scheduling , and aimed at improving the efficiency of products and taking good advantage of concurrence , asynchronism , distributing and juxtaposition in multi - products and devices processing , we could divide the working procedures into the attached one which has the only precursor and subsequence and unattached one by analyzing working flow chart of job - shop , that is the working procedures are divided into two types , then the bf and the ff methods about memory scheduling in os are applied , therefore a new approximate optimized scheme is presented in the paper which could solve the common job - shop scheduling . namely , the acpm and the bfsm are applied to the classified and grouped working procedures considering the compact of the procedures and practical examples approved it . the results we analyzing and tested show that it is better than the heuristic algorithm common used , for less restriction terms , more satisfying algorithm complexity and better optimized results
針對job - shop調(diào)度問題求最優(yōu)解算法這一npc問題，本文以充分發(fā)揮多產(chǎn)品、多設(shè)備加工所具有并發(fā)性、異步性、分布性和并行性的加工優(yōu)勢，從而提高產(chǎn)品的加工效率為目標(biāo)，對job - shop調(diào)度問題的工藝圖進(jìn)行適當(dāng)分解，使工序在一定時(shí)間段或是為具有唯一緊前、緊后相關(guān)工序或是為獨(dú)立工序，即將工序分兩類，再結(jié)合操作系統(tǒng)中內(nèi)存調(diào)度的最佳適應(yīng)( bf )調(diào)度方法和首次適應(yīng)( ff )調(diào)度方法的先進(jìn)思想，通過分析提出了一種解決一般job - shop調(diào)度問題的全新近優(yōu)解方案：在考慮關(guān)鍵設(shè)備上工序盡量緊湊的前提下，將工序分類、對這兩類工序分批采用擬關(guān)鍵路徑法( acpm )和最佳適應(yīng)調(diào)度方法( bfsm )安排工序的算法，用實(shí)例加以驗(yàn)證，并給出結(jié)果甘特圖。 - It's difficult to find memory scheduling in a sentence. 用memory scheduling造句挺難的